EM Optimization of Latent-Variables Density Models

نویسندگان

  • Christopher M. Bishop
  • Markus Svensén
  • Christopher K. I. Williams
چکیده

There is currently considerable interest in developing general non-linear density models based on latent, or hidden, variables. Such models have the ability to discover the presence of a relatively small number of underlying`causes' which, acting in combination, give rise to the apparent complexity of the observed data set. Unfortunately , to train such models generally requires large computational eeort. In this paper we introduce a novel latent variable algorithm which retains the general non-linear capabilities of previous models but which uses a training procedure based on the EM algorithm. We demonstrate the performance of the model on a toy problem and on data from ow diagnostics for a multi-phase oil pipeline.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EM Optimization of Latent-Variable Density Models

There is currently considerable interest in developing general nonlinear density models based on latent, or hidden, variables. Such models have the ability to discover the presence of a relatively small number of underlying 'causes' which, acting in combination, give rise to the apparent complexity of the observed data set. Unfortunately, to train such models generally requires large computatio...

متن کامل

Nesting Em Algorithms for Computational Efficiency

Computing posterior modes (e.g., maximum likelihood estimates) for models involving latent variables or missing data often involves complicated optimization procedures. By splitting this task into two simpler parts, however, EMtype algorithms often offer a simple solution. Although this approach has proven useful, in some settings even these simpler tasks are challenging. In particular, computa...

متن کامل

On Identification via EM with Latent Disturbances and Lagrangian Relaxation

In the application of the Expectation Maximization (EM) algorithm to identification of dynamical systems, latent variables are typically taken as system states, for simplicity. In this work, we propose a different choice of latent variables, namely, system disturbances. Such a formulation is shown, under certain circumstances, to improve the fidelity of bounds on the likelihood, and circumvent ...

متن کامل

A Spectral Algorithm for Latent Tree Graphical Models

Latent variable models are powerful tools for probabilistic modeling, and have been successfully applied to various domains, such as speech analysis and bioinformatics. However, parameter learning algorithms for latent variable models have predominantly relied on local search heuristics such as expectation maximization (EM). We propose a fast, local-minimum-free spectral algorithm for learning ...

متن کامل

EM Algorithm and its Application

The expectation-maximization (EM) algorithm aims to nd the maximum of a log-likelihood function, by alternating between conditional expectation (E) step and maximization (M) step. This survey rst introduces the general structure of the EM algorithm and the convergence guarantee. Then Gaussian Mixture Model (GMM) are employed to demonstrate how EM algorithm could be applied under Maximum-Likelih...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995